- mathematical subroutine
- matematiksel altyordam
English-Turkish dictionary. 2013.
mathematical subroutine
Look at other dictionaries:
Subroutine — In computer science, a subroutine (function, method, procedure, or subprogram) is a portion of code within a larger program, which performs a specific task and can be relatively independent of the remaining code. The syntax of many programming… … Wikipedia
Leslie Fox — (September 1918 Dewsbury, Yorkshire 1 August 1992 Oxford) was a British Mathematician noted for his contribution to numerical analysis.Fox studied mathematics as a Scholar of Christ Church, Oxford graduating with a First in 1939 and continued to… … Wikipedia
IMSL — acronym International Mathematical Subroutine Library … United dictionary of abbreviations and acronyms
Comparison of programming paradigms — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin … Wikipedia
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
computer — computerlike, adj. /keuhm pyooh teuhr/, n. 1. Also called processor. an electronic device designed to accept data, perform prescribed mathematical and logical operations at high speed, and display the results of these operations. Cf. analog… … Universalium
FOCAL-69 — was the landmark version of the FOCAL programming language, more widely publicized than the original version of the language created in 1968. FOCAL 69, created by Richard Merrill is important because: * It was the basis for all later derivatives… … Wikipedia
Fortran language features — This is a comprehensive overview of features of the Fortran 95 language, the version supported by almost all existing Fortran compilers. Old features that have been superseded by new ones are not described few of those historic features are used… … Wikipedia
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
Michigan Terminal System — (MTS) The MTS welcome screen as seen through a 3270 terminal emulator. Company / developer University of Michigan and 7 other universities in the US, Canada, and the UK … Wikipedia
Cycle detection — This article is about iterated functions. For another use, see Cycle detection (graph theory). In computer science, cycle detection is the algorithmic problem of finding a cycle in a sequence of iterated function values. For any function ƒ that… … Wikipedia
